Link Prediction Schemes Contra Weisfeiler-Leman Models
نویسندگان
چکیده
منابع مشابه
Weisfeiler-Leman meets Homomorphisms
In this paper, we relate a beautiful theory by Lovász with a popular heuristic algorithm for the graph isomorphism problem, namely the color refinement algorithm and its k-dimensional generalization known as the Weisfeiler-Leman algorithm. We prove that two graphsG andH are indistinguishable by the color refinement algorithm if and only if, for all trees T , the number Hom(T,G) of homomorphisms...
متن کاملDetecting Similar Programs via The Weisfeiler-Leman Graph Kernel
With the increasing availability of source code on the Internet, many new approaches to retrieve, repair, and reuse code have emerged that rely on the ability to efficiently compute the similarity of two pieces of code. The meaning of similarity, however, heavily depends on the application domain. For predicting API calls, for example, programs can be considered similar if they call a specific ...
متن کاملNonparametric Latent Feature Models for Link Prediction
As the availability and importance of relational data—such as the friendships summarized on a social networking website—increases, it becomes increasingly important to have good models for such data. The kinds of latent structure that have been considered for use in predicting links in such networks have been relatively limited. In particular, the machine learning community has focused on laten...
متن کاملStochastic Relational Models for Discriminative Link Prediction
We introduce a Gaussian process (GP) framework, stochastic relational models (SRM), for learning social, physical, and other relational phenomena where interactions between entities are observed. The key idea is to model the stochastic structure of entity relationships (i.e., links) via a tensor interaction of multiple GPs, each defined on one type of entities. These models in fact define a set...
متن کاملLatent Feature Models for Link Prediction
In recent years, several Bayesian models have been developed for link prediction in relational data. Models such as the Infinite Relational Model (IRM) [3] and the Mixed-Membership Stochastic Blockmodel (MMSB) [1] assume that there exists a set of latent classes that each object we observe can belong to and that each object either belongs to a single class or has a distribution over the classes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2018
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2018.090603